CREATING THE BEST ROUTING BY HEURISTIC ALGORITHM

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the vehicle routing problem by a hybrid meta-heuristic algorithm

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...

متن کامل

The N-Best Heuristic Search Algorithm

This paper presents a semi-optimal heuristic search algorithm called N-Best, which is both a functional extension and a simpler implementation of the First-Best Algorithm (the N-Best algorithm with N=1) presented in [1]. Certain real-world problems particularly those that are tackled by planners in Qualitative Reasoning need the construction of models with a high number of interacting elements....

متن کامل

The Pruned N-Best Heuristic Search Algorithm

This paper presents a semi-optimal heuristic search algorithm called Pruned N-Best, which has both the search behavior of the N-Best heuristic search algorithm and the minimization of backtracking search to applying a pruning technique over certain search paths. This minimization increases the Pruned N-Best algorithm efficiency when compared with others semi-optimal algorithms. In domains where...

متن کامل

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

متن کامل

A Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem

A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Engineering Technologies and Management Research

سال: 2020

ISSN: 2454-1907

DOI: 10.29121/ijetmr.v4.i12.2017.132